Transmission of data including conversion of ternary data to binary data

ABSTRACT

Binary data relating to a movable barrier operator is converted to ternary data. The ternary data is converted into corresponding binary information in a way not mirroring the first conversion method. In one approach, this second conversion converts each ternary trit into a corresponding binary pair. Initial binary bits correspond to, for example, fixed and/or non-fixed information.

RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.11/501,455 filed Aug. 9, 2006, issued as U.S. Pat. No. 8,422,667; whichis a continuation in part of:

U.S. application Ser. No. 11/480,288 filed on Jun. 30, 2006, issued asU.S. Pat. No. 7,561,075, which is a continuation of application Ser. No.11/044,411, filed on Jan. 27, 2005, and is now issued as U.S. Pat. No.7,071,850; and

U.S. application Ser. No. 11/172,525 filed Jun. 30, 2005, issued as U.S.Pat. No. 9,148,409;

the contents of each of which are fully incorporated herein by thisreference.

TECHNICAL FIELD

This invention relates generally to encrypted rolling codes and moreparticularly to the transmission of encrypted rolling code information.

BACKGROUND

Rolling codes are known in the art. Rolling codes are often used, forexample, in conjunction with movable barrier operators of various kinds(with movable barrier operators of various kinds also being known in theart and including operators that effect the selective control andmovement of single panel and segmented garage doors, pivoting, rolling,and swinging gates, guard arms, rolling shutters, and various othermovable barriers). In such an application setting, a wirelesstransmitter can send a code to a corresponding movable barrier operatorto cause the latter to effect a desired movement or other action withrespect to, for example, a corresponding movable barrier.

When using rolling codes, the code transmitted by the wirelesstransmitter will change (often with each transmission) in accordancewith a predetermined plan or algorithm that is also known to the movablebarrier operator. Such an approach can foil the use of an interceptedcode by an unauthorized party because that intercepted code will nottypically again, at least in the near term, be honored by that movablebarrier operator should the unauthorized party attempt to themselvestransmit that code. Without knowledge of the underlying scheme by whicha next code is selected, the unauthorized party who gains access to apresently used code will still remain unable to leverage that knowledgein support of effecting unauthorized control over the movable barrieroperator.

There may be instances, however, when additional security may be desiredor appropriate. For example, a given rolling code instantiation may beopen to brute force attacks or other weaknesses due to local and/orotherwise unique circumstances.

BRIEF DESCRIPTION OF THE DRAWINGS

The above needs are at least partially met through provision of themethod and apparatus to facilitate transmission of an encrypted rollingcode described in the following detailed description, particularly whenstudied in conjunction with the drawings, wherein:

FIG. 1 comprises a flow diagram as configured in accordance with variousembodiments of the invention;

FIG. 2 comprises a flow diagram as configured in accordance with variousembodiments of the invention;

FIG. 3 comprises a depiction of prior art ternary encoding;

FIG. 4 comprises a flow diagram as configured in accordance with variousembodiments of the invention;

FIG. 5 comprises a flow diagram as configured in accordance with variousembodiments of the invention;

FIG. 6 comprises a mapping table as configured in accordance withvarious embodiments of the invention;

FIG. 7 comprises a schematic view of bit processing and parsing inaccordance with various embodiments of the invention;

FIG. 8 comprises a comprises a schematic joint message diagram asconfigured in accordance with various embodiments of the invention;

FIG. 9 comprises a schematic view of bit selection and parsing asconfigured in accordance with various embodiments of the invention;

FIG. 10 comprises an illustrative example of a lookup table asconfigured in accordance with various embodiments of the invention;

FIG. 11 comprises a schematic view of two joint messages as configuredin accordance with various embodiments of the invention;

FIG. 12 comprises a schematic view of bit parsing as configured inaccordance with various embodiments of the invention;

FIG. 13 comprises a schematic view of a joint message as configured inaccordance with various embodiments of the invention;

FIG. 14 comprises an illustrative example of a lookup table asconfigured in accordance with various embodiments of the invention;

FIG. 15 comprises a schematic view of bit processing and parsing asconfigured in accordance with various embodiments of the invention;

FIG. 16 comprises a schematic view of a joint message as configured inaccordance with various embodiments of the invention;

FIG. 17 comprises an illustrative example of a lookup table asconfigured in accordance with various embodiments of the invention; and

FIG. 18 comprises a block diagram as configured in accordance withvarious embodiments of the invention.

Skilled artisans will appreciate that elements in the figures areillustrated for simplicity and clarity and have not necessarily beendrawn to scale. For example, the dimensions and/or relative positioningof some of the elements in the figures may be exaggerated relative toother elements to help to improve understanding of various embodimentsof the present invention. Also, common but well-understood elements thatare useful or necessary in a commercially feasible embodiment are oftennot depicted in order to facilitate a less obstructed view of thesevarious embodiments of the present invention. It will also be understoodthat the terms and expressions used herein have the ordinary meaning asis accorded to such terms and expressions with respect to theircorresponding respective areas of inquiry and study except wherespecific meanings have otherwise been set forth herein.

DETAILED DESCRIPTION

Generally speaking, pursuant to these various embodiments, an encryptedrolling code, a plurality of differing data bit order patterns, and aplurality of differing data inversion patterns are provided. One selectsa particular one of each of the bit order patterns and the datainversion patterns to provide selected patterns and then uses thoseselected patterns as transmission characteristics when transmitting atleast part of the encrypted rolling code.

By these teachings, for example, a wireless remote control transmittercan be provided with data to be transmitted, where that data comprises,at least in part, at least portions of an encrypted rolling code andwhere that data comports with a particular data bit order pattern and aparticular data inversion pattern as a function of a given portion ofthat rolling code. That data can then be transmitted in combination withthe given portion of the encrypted rolling code wherein that givenportion of the rolling code is not transmitted with any of its bitsreordered or inverted as a function of the given portion itself.Accordingly, a receiver that receives the data can then properly recoverthe re-ordered/inverted portions of the encrypted rolling code as afunction of the given portion of the encrypted rolling code.

By one approach, if desired, the aforementioned data can compriseternary data that is presented in a binary format. The use of ternarydata can aid in facilitating compatible interaction with at least somemovable barrier operators while also achieving an encryption effect atthe same time as tending to ensure compatible use with binary peripheralplatforms and the like. By one approach, this can comprise mapping eachtrit of the ternary data to a corresponding pair of binary bits. A pairof binary bits can represent 4 discrete information elements and by oneapproach, three of these discrete information elements can eachcorrespond to one of the three trit states/levels while the fourthdiscrete information element (which otherwise comprises an illegalvalue) can serve a synchronization function.

If desired, in addition to the aforementioned encrypted rolling code, afixed code can also be included in the transmission. By one approach,for example, both the aforementioned part of the encrypted rolling codeand this fixed code can be transmitted using the above-describedselected patterns as transmission characteristics.

These and other benefits may become clearer upon making a thoroughreview and study of the following detailed description. Referring now tothe drawings, and in particular to FIG. 1, an illustrative process inthis regard provides 11 an encrypted rolling code. As will beillustrated in more detail below, this can comprise, if desired,providing an encrypted rolling code as a plurality of bit pairs ascorrespond to a ternary data set.

If desired, this process will also optionally accommodate providing 12 afixed code. This fixed code can vary with the needs, requirements,and/or opportunities of a given application setting, but can, forexample, comprise a value that is substantially unique to a giventransmitter and hence comprises a value that will serve to identify thatgiven transmitter. Such an approach can be useful, for example, whenused in conjunction with a remote control movable barrier operatortransmitter.

This process also provides 13 a plurality of differing data bit orderpatterns. By one approach, for example, this can comprise data bit orderpatterns that each comprise a pattern for exactly three bits. As will beshown below, this can be particularly beneficial when used inconjunction with bit pairs that correlate to corresponding ternary data.Similarly, this process provides 14 a plurality of different datainversion patterns. As before, if desired, this can comprise providingpatterns that each comprise a pattern for exactly three bits. The numberof patterns provided in either case can vary as desired. By oneapproach, however, this can comprise providing at least nine differentbit order patterns and nine different data inversion patterns.Illustrative examples in this regard are provided further herein.

This process then provides for selecting 15 a particular one of each ofthe data bit order patterns and the data inversion patterns to provideresultant corresponding selected patterns. There are various ways bywhich such selections can be made. By one approach, one may use apredetermined portion of the previously provided encrypted rolling codeto inform the making of these selections. For example (and as will beillustrated in more detail herein), this can comprise using apredetermined four bit pairs of the encrypted rolling code as a basisfor selecting the particular data bit order pattern and the particulardata inversion pattern. As another example in this regard, incombination with the foregoing or in lieu thereof, this can compriseusing a first predetermined portion of the encrypted rolling code toselect a first particular data bit order pattern and a first datainversion pattern and using a second predetermined portion of theencrypted rolling code (that is, for example, discrete with respect tothe first predetermined portion of the encrypted rolling code thoughthis is not a fundamental requirement) to select a second particulardata bit order pattern and a second data inversion pattern.

This process then provides for transmitting 16 at least a part of theencrypted rolling code itself (as well as at least a part of theabove-described fixed code when present) using the aforementionedselected patterns as transmission characteristics. By one approach thiscan comprise making such a transmission using Manchester encoding as isknown in the art.

So configured, these teachings are readily employed, for example, tofacilitate the transmission of a remote control message. This cancomprise, for example, providing a fixed message having at least a firstpart and a second part along with an encrypted rolling code that has afirst through a fourth part. The first part of the encrypted rollingcode can then be used to select a particular data bit order pattern anda data inversion pattern to use as a set of first selected patternswhile the second part of the encrypted rolling code can be used toselect a second set of patterns from amongst the available candidatepatterns. One can then transmit the first part of the fixed message andthe third part of the encrypted rolling code using the first selectedpatterns as transmission characteristics while transmitting the secondpart of the fixed message and the fourth art of the encrypted rollingcode using the second selected patterns as transmission characteristics.

By one approach, in this illustrative example this can also comprisetransmitting the first and second parts of the encrypted rolling codewithout using either the first or selected patterns as transmissioncharacteristics. So configured, the first and second parts of theencrypted rolling code are then readily usable as recovery identifiersthat can be used by a receiver to recover the first and second parts ofthe fixed message and the third and fourth parts of the encryptedrolling code.

To illustrate further in this regard, these first and second parts ofthe encrypted rolling code could each comprise four bit pairs ascorrespond to the aforementioned ternary data. In such a case, two ofthe bit pairs as comprise the first part of the encrypted rolling codecan be used with a lookup table to correlate those two bit pairs to acorresponding data bit order pattern. In a similar manner the remainingbit pairs can be used with a second lookup table (which may, if desired,actually comprise a part of the first lookup table) to correlate thesebit pairs with a corresponding data inversion pattern. In a similarfashion, two of the bit pairs of the four bit pairs as comprise thesecond part of the encrypted rolling code can be used with that firstlookup table to identify another data bit order pattern while theremaining two bit pairs can be used with the second lookup table toidentify a corresponding data inversion pattern.

In such a case, the aforementioned transmission can then comprisetransmitting the second part of the fixed message and the fourth part ofthe encrypted rolling code using the second selected patterns astransmission characteristics only after not transmitting for at least apredetermined period of time following transmission of the first part ofthe fixed message and the third part of the encrypted rolling code usingthe first selected patterns as transmission characteristics. Theduration of this predetermined period of time can vary with the needsand opportunities of a given application setting, but a duration ofabout 75 milliseconds will suffice for many expected purposes.

In addition to facilitating a transmission of an encrypted rolling codeand other content that comprises, for example, information that isunique to a given transmitter (such as a unique identifier for thattransmitter), these teachings will further readily accommodate thetransmission of additional data that is not substantially unique to thetransmitter. This can comprise, for example, providing a data payload(such as a remote control instruction such as OPEN, CLOSE, VACATIONMODE, LIGHTS ON, LIGHTS OFF, and so forth) that is not substantiallyunique to a given transmitter and then transmitting the first part ofthe fixed message, the third part of the encrypted rolling code, and afirst part of this data payload while using the first selected patternsas transmission characteristics and transmitting the second part of thefixed message, the fourth part of the encrypted rolling code, and asecond (remaining) portion of the data payload using the second selectedpatterns as transmission characteristics. When the data payloadcomprises a relatively large quantity of data as compared to the fixedmessage and/or the encrypted rolling code, additional portions of thedata payload as are not accommodated by the just-described process canthen be supplementally transmitted using one of the already selectedpatterns (or other patterns, if desired) as transmissioncharacteristics.

As another specific illustrative example in this regard, and referringnow to FIG. 2, a wireless remote control transmitter (such as a movablebarrier operator remote control) can be configured and arranged toprovide 21 data to be transmitted. This data can comprise, at least inpart, at least portions of an encrypted rolling code. In any event, thisdata will comport with a particular data bit order pattern and aparticular data inversion pattern as a function of a given portion ofthe rolling code. By one approach, if desired, this process can furthercomprise, at least in part, storing 22 this data in a memory prior totransmitting the data. The duration of such storage can varyconsiderably depending upon the specifics of a given applicationsetting.

This wireless remote control transmitter can then transmit 23 this datain combination with the given portion of the encrypted rolling code suchthat the given portion of the encrypted rolling code is not transmittedwith any of its bits reordered or inverted as a function of the givenportion of the encrypted rolling code. So configured, a receiver thatreceives this data can properly recover the modified portions of theencrypted rolling code as a function, at least in part, of theunmodified given portion of the encrypted rolling code.

As noted above, these teachings are readily applied in a context thatmakes use of ternary data. It may therefore be helpful to first describein more detail a typical ternary data protocol as one finds oftendeployed in conjunction with many movable barrier operators. Pursuant toone approach, pulses of similar amplitude have one of three differentdurations. For example, and referring now to FIG. 3, a first pulse 31,having a shortest duration, can represent the data element “0.” A secondpulse 32, having a medium length duration, can represent the dataelement or state “1.” And a third pulse 33, having a longest duration,can represent the data element or state “2.” Such a data mappingprotocol serves well to effect a base three-based data exchange. Thepresent teachings can accommodate use and leveraging of a ternaryapproach to effect relatively secure and compatible communicationsbetween a movable barrier operators and corresponding peripheralcomponents of choice. These teachings are also compatible for use withan approach that eschews the specific ternary approach just described.

Referring now to FIG. 4, in general, these teachings will accommodate aprocess 40 that itself provides 41 ternary data as corresponds to amovable barrier operator and then converts 42 that ternary data to abinary format to provide resultant binary information. This binaryinformation is then transmitted 43 from one platform to another. As willbe shown below, this ternary-to-binary conversion process serves, atleast in part, as a kind of encryption process which in turn aids inensuring the authenticity and accuracy of the information beingtransmitted.

The ternary data itself can comprise, at least in part, bearer data.More particularly, and referring momentarily to FIG. 5, pursuant to one(optional) approach, provision of ternary data can comprise priorprovision 51 of binary bits comprising information that corresponds tothe movable barrier operator (for example, information sourced by, orintended for, a movable barrier operator). Such information canoptionally comprise, for example, movable barrier operator fixedinformation 52 such as identifying information for a particular movablebarrier operator, a particular peripheral component, or the like. Suchinformation can also optionally comprise (in addition to or in lieu offixed information 52) non-fixed information 53 such as theaforementioned data payload as again corresponds to the movable barrieroperator. This non-fixed information 53 can comprise bearerdata/information (such as, but not limited to, platform statusinformation, commands, acknowledgments, and so forth). As already noted,this non-fixed information 53 can also comprise varying quantities ofdata if desired.

These binary bits are then converted 54 into the aforementioned ternarydata. This could comprise, in an appropriate platform, a conversion ofthe binary data into ternary data such as that described above withrespect to FIG. 3. In general, such an approach need not be used.Instead, the binary data can be converted into a binary-bit-basedternary format (with an illustrative example being provided furtherbelow).

By one approach, however, this does not comprise a simple reversal ofthe binary-to-ternary process just described. Instead, theternary-to-binary conversion step can comprise mapping each trit of theternary data to a corresponding pair of binary bits. To illustrate sucha map 61, and referring momentarily to FIG. 6, the ternary data element“0” (which corresponds to the usual binary data element “0”) maps to thebinary pair “00.” In similar fashion, ternary “1” (which corresponds tousual binary “1”) maps to the binary pair “01” and ternary “2” (whichcorresponds to usual binary “11”) maps to the binary pair “01.”

This leaves an otherwise unused binary pair “11.” Pursuant to apreferred approach, this otherwise illegal value can serve asynchronization function when facilitating communications as between amovable barrier operator and one or more peripheral components whenusing a binary format that otherwise has no synchronization mechanismbuilt into its format (for example, a stream of binary bits such as:

011011111110100111011101101111111010011101110110111111101001110111

which format lacks a frame marker or other point of synchronization). Toillustrate, a synchronization signal/marker comprising this “11” binarypair can be used to indicate, for example, the regular end and/or startof a frame or message as in the following example:

110110111111011110111011110110111111101111110111111101101111111011111

where the bold font “11” regularly spaced binary pairs serve as framemarkers (and which, due to their synchronized regular spacing, arereadily distinguishable from other “11” pairs as may occur for whateverreason (illustratively depicted in the above example with italic font).

Those skilled in the art will appreciate that this process of convertingbinary information into ternary information, followed by conversion ofthat ternary information into corresponding binary pairs, yields, inmost cases, a different bit sequence (and even a different number ofbits) as compared to the initial binary information. This differenceserves, at least in part, as a non-key-based encryption technique andhence provides a way of effecting the provision of an encrypted rollingcode.

Referring now to FIG. 7, a more detailed illustrative embodiment will bepresented. In this first illustrative example, the only substantivecontent to be associated and transmitted with a 28 bit rolling code 71comprises a 40 bit value that represents fixed information 72. Thisfixed information 72 may serve, for example, to uniquely identify thetransmitter that will ultimately transmit this information as notedabove.

In this particular illustrative embodiment, the bits comprising therolling code 71 are encrypted 73 by mirroring the bits and thentranslating those mirrored bits into ternary values as suggested aboveto provide corresponding bit pairs (in this example, this would comprise18 such bit pairs) to thereby provide a resultant encrypted rolling code74. This mirroring can be applied to specific groupings of bits in therolling code creating mirrored groups or can involve the entire value.In this illustrative example, the encrypted rolling code 74 is presentedfor further processing as four groups. In this example, these fourgroups comprise a roll group E 74A comprised of four binary bit pairs, aroll group F 74B comprised of five binary bit pairs, a roll group G 74Ccomprised of four binary bit pairs, and a roll group H 74D comprised offive binary bit pairs.

The 40 bit fixed information 72 is subdivided in a similar manner albeitsans encryption. This comprises, in this particular illustrativeapproach, forming four subgroups comprising a fixed group A 75A, a fixedgroup B 75B, a fixed group C 75C, and a fixed group D 75D, wherein eachsuch group is comprised of 10 bits of the original 40 bit value.

These variously partitioned data groups can then be used as shown inFIG. 8 to effect a desired transmission. In this example, one or morejoint messages 80 provide a primary vehicle by which to communicate thedesired information (which includes both the encrypted rolling code andfixed information data as modified as a function of a given portion ofthe encrypted rolling code along with a recovery identifier thatrepresents that given portion of the encrypted rolling code). This jointmessage 80 comprises, generally speaking, a first 20 bit portion 81 anda second 30 bit portion 82.

The first portion 81 comprises, in this embodiment, the followingfields:

-   -   “0000”—these bits 81A serve to precharge the decoding process        and effectively establish an operational threshold;    -   “1111”—these bits 81B comprise two bit pairs that present the        illegal state “11” (“illegal” because this corresponds to a        fourth unassigned state in the ternary context of these        communications) and serve here as a basis for facilitating        synchronization with a receiving platform;    -   “00”—this bit pair 81C identifies a type of payload being borne        by the joint message (in this embodiment, “00” corresponds to no        payload other than the fixed identifying information for the        transmitter itself, “01” corresponds to a supplemental data        payload, and “10” corresponds to a supplemental data-only        payload—further explanation regarding these payload types        appears further below);    -   “Xx”—this bit pair 81D presents a frame identifier that can be        used by a receiver to determine whether all required joint        messages 80 have been received and which can also be used to        facilitate proper reconstruction of the transmitted data;    -   “B3, B2, B1, B0”—these two bit pairs 81E comprise an inversion        pattern recovery identifier and are selected from the bits that        comprise the encrypted rolling code 74 described above;    -   “B7, B6, B5, B4”—these two bit pairs 81F comprise a bit order        pattern recovery identifier and are also selected from the bits        that comprise the encrypted rolling code 74 described above.

There are various ways by which these recover identifier values can beselected. Referring momentarily to FIG. 9, by one approach, eight bitsfrom the encrypted roll group 74 are selected to form a correspondingroll sub-group 91. These might comprise, for example, the first or thelast eight bits of the encrypted roll group 74 (in a forward or reversedorder). These might also comprise, for example, any eight consecutivebits beginning with any pre-selected bit position (such as, toillustrate, the seventh bit, the 21^(st) bit, and so forth). Otherpossibilities also exist. For example, only even position bits or oddposition bits could serve in this regard. It would also be possible, forexample, to use preselected bits as comprise one or more of thepreviously described roll group sub-groups such as roll group E 74A orroll group G 74C.

It would also be possible to vary the selection mechanism from, forexample, joint message to joint message. By one simple approach in thisregard, for example, the first eight bits of the encrypted roll group 74could be used to form the roll sub-group 91 with the last eight bits ofthe encrypted roll group 74 being used in a similar fashion in analternating manner.

The eight bits that comprise this roll sub-group 91 are then furtherparsed to form the two recovery indicators 81E and 81F mentioned above.Again, there are numerous ways by which one may use the bits thatcomprise the roll sub-group 91 to form these recovery indicators 81E and81F. By one simple approach, for example, the bits as comprise the rollsub-group 91 can be used in their existing (or reversed) order to formroll group 1 81E and roll group 2 81F. Using this approach, for example,bit B3 of roll group 1 81E would comprise bit seven from the rollsub-group 91 with bit B2 then corresponding to bit six and so forth.

By another approach, if desired, every other bit can be applied in thismanner. So configured, for example, bit B3 could comprise bit six fromthe roll sub-group 91, bit B2 could comprise bit four from the rollsub-group 91, and so forth. In such a case, bit B7 would then comprisebit seven from the roll sub-group 91, bit B6 would comprise bit fivefrom the roll sub-group 91, and so forth.

Referring again to FIG. 8, in this embodiment, the “B7, B6, B5, B4”values from the corresponding recovery indicator are used in conjunctionwith one or more lookup tables to determine a data bit order pattern touse with respect to formatting the data as comprises the second portion82 of the joint message 80. Similarly, the “B3, B2, B1, B0” values areused in conjunction with a lookup table to determine a data bit orderpattern to also use with that second portion 82 of the joint message 80.

Before providing further elaboration regarding an illustrative exampleof such lookup tables and their use, it will be helpful to first notethat, in this example, the data in the second portion 82 of the jointmessage comprises 10 bits from roll group F (or H) and 10 bits each fromfixed group A (or C) and fixed group B (or D) for a total of 30 bits.These bits are organized into triplets (shown in FIG. 8 in the form “(F,B, A)” and “(H, D, C)” to indicate that each such triplet includes onebit from a roll group F or H and one bit each from the two fixed groupsB and A or D and C.

Those skilled in the art will note that, in this illustrative example,bits from roll group E 74A and roll group G 74C are not present in thesecond portion 82 of the joint message 80. This is because, in thisexample, it is presumed that the contents of these two roll groups areused to form the recovery indicators that appear in the first portion 81of the joint message 80. Other accommodations can of course be made inthis regard. In general, however, these teachings will accommodate notincluding those encrypted rolling code bits that are used as recoveryindicators in the second portion 82 of the joint message 80.

In the example shown, the order of the bits in each triplet is “F, B, A”(or “H, D, C” as appropriate). This order is neither arbitrary norstatic. Instead, for this particular joint message 80, this order of thebits in each triplet is dictated by the values B7, B6, B5, B4 notedabove. In this case, and referring now to FIG. 10, a lookup table 101serves to correlate various values for these two bit pairs withcorresponding data bit order patterns. In this example, presuming thatthe values of these four bits happens to be “0000,” the correspondingorder of bits for each triplet is established as “F/H, B/D, A/C” andhence the ordering of the bits depicted in FIG. 8.

Those skilled in the art will note that this lookup table 101 providesno patterns that would correlate to two bit pairs having the value “11.”This is because, in this embodiment, “11” as a bit pair value comprisesan illegal value and hence is not expected to occur. Accordingly thereare no bit order patterns presented to correlate with such values as“11XX,” “XX11,” or “1111.” This creates 9 possible selections for theorder of bits and the inversion value. The number of possible uniqueorder of three bits leads to only six different bit order patterns. Thisdegree of diversity should suffice for most if not all purposes.

The aforementioned B3, B2, B1, B0 values 81F are employed in a similarfashion with this lookup table 101 to identify a particular inversionpattern to be employed with the data triplets of the second portion 82of the joint message 80. For example, when these bits are “0000,” thislookup table provides for no inversion of any of the bits in eachtriplet. On the other hand, when these bits are “1010,” each bit of eachtriplet is to be inverted. In this case, up to eight different inversionpatterns are possible.

To illustrate further, when a given data triplet happens to have thevalues “110” and the inversion indicator has the values “0100,” thelookup table will return a data inversion pattern of “normal invertinvert.” As a result, this particular data triplet will instead have thevalues “101” because the second and third values in each triplet are nowto be inverted in value.

So configured, a first portion of a joint message is seen to include arecovery indicator that itself comprises a selected portion of anencrypted rolling code. A second portion of that joint message, in turn,contains data triplets having bits that are arranged in a particularorder and that observe a particular inversion pattern as a function ofthat joint indicator. Accordingly, it will not be sufficient for anunauthorized party to simply glean, in some fashion, the basis of therolling code itself. Instead, now, this unauthorized party must also nowunderstand how a particular portion of that rolling code is used tomodify the transmission of other portions of that rolling code inaddition to fixed information as may also accompany the rolling code.

In many application settings it may be desirable to present more thanone such joint message to present a complete transmission. For example,and referring now to FIG. 11, it may be desirable to use two (or more)such joint messages 80A and 80B in order to present the complete rollingcode and the complete fixed content and was described above. In such acase, for example, the first joint message 80A can present and use afirst roll sub-group 91 as defined above as a recovery identifier (whichcomprises, in this illustrative example, roll group E 74A) while thesecond joint message 80B presents and uses a second, different rollsub-group B 91 (which comprises, in this illustrative example, rollgroup G 74C) for this purpose. These recovery identifiers can be used asjust described to control modification of their corresponding data. Soconfigured, in this illustrative example, 10 bits of roll group F 74B,10 bits of fixed group A 75A, and 10 bits of fixed group B 75B havetheir bits ordered and inverted as a function of the bits of roll groupE 74A while 10 bits of roll group H 74D, 10 bits of fixed group C 75C,and 10 bits of fixed group D 75D are similarly ordered/inverted as afunction of the bits of roll group G 74C.

If desired, these joint messages 80A and 80B can be sent in aconcatenated manner. By another approach, however, these joint messagescan be separated by at least a minimal amount of silence (achieved, forexample, by not transmitting during this period of time). For example,75 milliseconds or so of blank time can be used for this purpose. Soconfigured, a receiver that receives a second joint message prior tothis period of blank time expiring can conclude that one or both of thereceived messages is somehow in error and should be avoided.

As noted above, in some cases it may be useful to transmit an additionalamount of data or information than that specifically provided above. Forexample, it may be useful to transmit additional data that represents aparticular instruction, status information, or the like. Such additionalinformation can be readily accommodated by the teachings set forthabove. To illustrate, and referring now to FIG. 12, 32 bits of suchadditional data can be subdivided into four corresponding data groups Iand J 122A and 122B and K and L 122C and 122D where each such data grouphas eight bits.

Referring now to FIG. 13, the second portion 82 of each joint message 80can now comprise 54 bits. By one approach, this can comprise 8 bits fora repeated presentation of the same rolling code group E or G ascomprises the recovery identifier, 10 bits each for rolling code group For H, fixed group A or C, and fixed group B or D, as well as 8 bits eachfor data group I or K and data group J or L as are described above.These various bits are again combined into data triplets using a groupselection pattern such as that illustrated in FIG. 13. And, once again,the recovery identifier comprised of the roll group presented in thefirst portion 81 of the joint message 80 is used to select from a lookuptable(s) the particular bit order and inversion patterns to employ withrespect to these data triplets. In this case, and referring now to FIG.14, the lookup table 141 can include specific bit order patterns thatapply in different ways depending upon whether the data triplet includesthe supplemental data.

In some cases, it may be necessary or appropriate to transmit even alarger quantity of data than can be accommodated by the processes andtechniques described above. In such a case, if desired, additionalsupplemental joint messages can be used to present such supplementaldata. With reference to FIG. 15, 32 bit value data elements 151 can beparsed using an application defined algorithm 152 of choice ascorresponds to the data itself (or as may be otherwise provided orselected) into four ternary bit pairs 153 and three data groups of Nbits each 154A-154C.

Referring now to FIG. 16, the recovery indicator can be reused from aprevious related joint message and the second portion 82 of the jointmessage 80 can contain 3 to the Nth power bits as necessary toaccommodate the full data payload. The three data groups A-C are thenused to form corresponding data triplets. And, as before, the recoveryidentifier is used to extract from a corresponding lookup table (such asthe lookup table 171 presented in FIG. 17) the particular bit orderpattern and bit inversion pattern to employ with respect to thetransmission of these data triplets.

Those skilled in the art will appreciate that the above-describedprocesses are readily enabled using any of a wide variety of availableand/or readily configured platforms, including partially or whollyprogrammable platforms as are known in the art or dedicated purposeplatforms as may be desired for some applications. Referring now to FIG.18, an illustrative approach to such a platform will now be provided.

In this illustrative embodiment, the apparatus 180 (which may comprise,for example, a wireless remote control transmitter) comprises aprocessor 181 that couples to a transmitter 182 (such as a wirelesstransmitter) of choice. Both of these components then also operablycouple to a first memory 183, a second memory 184, a first lookup table185, and a second lookup table 186. The first memory 183 can have afixed value stored therein. This fixed value can comprise, for example,information that substantially uniquely identifies this particularapparatus 180. This first memory 183 may also, if desired, have aplurality of different fixed values contained therein. This would permitstoring, for example, remote control signals that are not specific(i.e., unique) to the apparatus 180 itself.

The second memory 184 can have the aforementioned encrypted rolling codestored therein. By one approach, the processor 181 is configured andarranged to calculate the encrypted rolling code when needed and totemporarily buffer that value in the second memory 184 pending actualuse of that information. By another approach, the encrypted rolling codeinformation can be pre-provisioned using a derivation and storageapproach of choice.

The lookup tables 185 and 186 are the lookup tables described above. Forexample, the first lookup table 185 can comprise the lookup table thatcorrelates a first plurality of different encrypted rolling code valueswith corresponding differing data bit order patterns. Similarly, thesecond lookup table 186 can comprise the lookup table that correlates asecond plurality of different encrypted rolling code values withcorresponding different data inversion patterns.

The processor 181 itself is configured and arranged (via, for example,appropriate programming) to carry out selected teachings as have beenpresented above. So configured, for example, the processor 181 can beconfigured and arranged to use the encrypted rolling code to select onesof the particular data bit order patterns and data inversion patternsfor the transmitter 182 to use as transmission characteristics whentransmitting the fixed value and at least portions of the encryptedrolling code. In particular, if desired, the processor can use a firstpart of the encrypted rolling code to select a data bit order patternand a data inversion pattern to use when transmitting a first part ofthe encrypted rolling code and the fixed value and a second, differentpart of the encrypted rolling code to select a data bit order patternand a data inversion pattern to use when transmitting a second,different part of the encrypted rolling code and the fixed value.

Those skilled in the art will recognize and understand that such anapparatus 180 may be comprised of a plurality of physically distinctelements as is suggested by the illustration shown in FIG. 18. It isalso possible, however, to view this illustration as comprising alogical view, in which case one or more of these elements can be enabledand realized via a shared platform and/or a more-widely-distributedplatform. It will also be understood that such a shared platform maycomprise a wholly or at least partially programmable platform as areknown in the art.

So configured, those skilled in the art will recognize and appreciatethat these teachings offer great flexibility and opportunity withrespect to further protecting information during a wireless transmissionof that information. These teachings have particular relevance totransmissions of rolling codes and offer particular advantages when alsoused in conjunction with the transmission of fixed information inaddition to rolling code information. The particular transmissioncharacteristics presented are largely compatible for use with a widevariety of wireless modulation techniques. Those skilled in the art willalso appreciate that these teachings are highly compatible for use withbinary-based representations of ternary data formats.

Those skilled in the art will recognize that a wide variety ofmodifications, alterations, and combinations can be made with respect tothe above described embodiments without departing from the spirit andscope of the invention, and that such modifications, alterations, andcombinations are to be viewed as being within the ambit of the inventiveconcept.

What is claimed is:
 1. A method comprising: preparing for transmissionof data between a movable barrier operator and a peripheral device by:converting first binary data comprising information relating to themovable barrier operator into ternary data using a first conversionmethod; converting the ternary data to a binary format to provide binaryinformation representative of the information relating to the movablebarrier operator, the converting done in a way not mirroring the firstconversion method; transmitting the binary information between themovable barrier operator and the peripheral device includingtransmitting pairs of binary bits wherein at least one of the pairs ofbinary bits represents a particular ternary value and a different one ofthe pairs of binary bits represents an illegal value; receiving by oneof the movable barrier operator and the peripheral device at least onepair of binary bits representing the illegal value to effectsynchronization of communication between the movable barrier operatorand the peripheral device by using the illegal value as a marker forstarting or ending reading the binary information.
 2. The method ofclaim 1 wherein the converting the ternary data to the binary formatcomprises mapping each trit of the ternary data to a corresponding pairof converted binary bits.
 3. The method of claim 1 wherein thetransmitting the binary information further comprises transmitting: afirst particular bit pair representing a payload type for use by areceiving device; a second particular bit pair representing a frameidentification for use by the receiving device; a third particular setof one or more bit pairs representing inversion indicator informationfor use by the receiving device to recover at least a portion of thefirst binary data.
 4. The method of claim 1 wherein the first binarydata comprises fixed information corresponding to the movable barrieroperator.
 5. The method of claim 4 wherein the fixed informationcomprises identifying information.
 6. The method of claim 5 wherein thefirst binary data further comprises non-fixed information correspondingto the movable barrier operator.
 7. The method of claim 1 furthercomprising providing the first binary data, including combining at leastsome of first binary bits with rolling code bits.
 8. A methodcomprising: converting first binary data comprising information relatingto a movable barrier operator into ternary data using a first conversionmethod; converting the ternary data to a binary format to provide binaryinformation representative of the information relating to the movablebarrier operator, the converting done in a way not mirroring the firstconversion method; transmitting the binary information between themovable barrier operator and a peripheral device; providing the firstbinary data, including combining at least some of first binary bits withrolling code bits; wherein combining at least some of the first binarybits with rolling code bits further comprises: exclusive ORing the firstbinary bits with the rolling code bits to provide encrypted bits;concatenating the encrypted bits with the rolling code bits to provideresultant bits; reverse ordering the resultant bits to provide reverseordered bits; and wherein converting the first binary data into theternary data further comprises: converting the reverse ordered bits intothe ternary data.
 9. The method of claim 8 and further comprising:interleaving the ternary data with other ternary data; and whereinconverting the ternary data to a binary format further comprisesconverting the interleaved ternary data to the binary format to providethe binary information.
 10. The method of claim 9 wherein interleavingthe ternary data with other ternary data further comprises: providingadditional binary bits comprising information corresponding to themovable barrier operator; converting the additional binary bitscomprising information corresponding to the movable barrier operatorinto intermediate ternary data; modifying the intermediate ternary datausing rolling code information to provide the other ternary data. 11.The method of claim 10 wherein modifying the intermediate ternary datausing rolling code information further comprises: modifying theintermediate ternary data using the ternary data.
 12. The method ofclaim 1 wherein the transmitting the binary information comprisestransmitting the binary information to at least one of: a movablebarrier operator, an alarm system, or a sensor.
 13. An apparatuscomprising a movable barrier operator and a device that communicateswith a movable barrier operator, one of the movable barrier operator andthe device that communicates with the movable barrier operatorcomprising: a memory device configured to store first binary datacomprising information relating to the movable barrier operator; aprocessing device in operable communication with the memory device andconfigured to prepare for transmission of data between the movablebarrier operator and the device that communicates with the movablebarrier operator by converting the first binary data into ternary datausing a first conversion method and converting the ternary data to abinary-formatted version in a way not mirroring the first conversionmethod; a transmitter operably coupled to the processing device and thememory device and configured to externally transmit the binary-formattedversion of the ternary data to an other of the movable barrier operatorand the device that communicates with the movable barrier operator bytransmitting pairs of binary bits wherein at least one of the pairs ofbinary bits represents a particular ternary value and a different one ofthe pairs of binary bits represents an illegal value, and the other ofthe movable barrier operator and the device that communicates with themovable barrier operator comprises a receiver and a processing device inoperable communication with the receiver and is configured to effectsynchronization of communication between the movable barrier operatorand the device that communicates with the movable barrier operator byreceiving the at least one pair of binary bits representing the illegalvalue and using the illegal value as a marker for starting or endingreading the binary information.
 14. The apparatus of claim 13 whereinthe processing device is further configured to convert the ternary datato the binary-formatted version by mapping each trit of the ternary datato a corresponding pair of binary bits.
 15. The apparatus of claim 13wherein the first binary data comprises fixed identifying informationcorresponding to the movable barrier operator, non-fixed informationcorresponding to the movable barrier operator, or both.
 16. Theapparatus of claim 13 wherein the processing device is furtherconfigured to create the first binary data in part by combining at leastsome of first binary bits with rolling code bits.
 17. An apparatuscomprising at least one of a movable barrier operator and a device thatcommunicates with a movable barrier operator, the apparatus comprising:a memory device configured to store first binary data comprisinginformation relating to a movable barrier operator; a processing devicein operable communication with the memory device and configured toconvert the first binary data into ternary data using a first conversionmethod and to convert the ternary data to a binary-formatted version ina way not mirroring the first conversion method; a transmitter operablycoupled to the processing device and the memory device and configured toexternally transmit the binary-formatted version of the ternary data toone of the movable barrier operator and the device that communicateswith the movable barrier operator; wherein the processing device isfurther configured to combine at least some of first binary bits withrolling code bits by: exclusive ORing the first binary bits with therolling code bits to provide encrypted bits; concatenating the encryptedbits with the rolling code bits to provide resultant bits; reverseordering the resultant bits to provide reverse ordered bits; and whereinthe processing device is further configured to convert the first binarydata into the ternary data by converting the reverse ordered bits intothe ternary data.
 18. The apparatus of claim 17 wherein the processingdevice is further configured to interleave the ternary data with otherternary data; and wherein the processing device is further configured toconvert the ternary data to a binary format by converting theinterleaved ternary data to the binary-formatted version.
 19. The methodof claim 8 wherein the transmitting the binary information comprisestransmitting pairs of binary bits wherein at least one of the pairs ofbinary bits represents a particular ternary value and a different one ofthe pairs of binary bits represents an illegal value; wherein thetransmitting the binary information further comprises transmitting atleast one pair of binary bits representing the illegal value to effectsynchronization of communication between the movable barrier operatorand the peripheral device.
 20. The method of claim 19 wherein thetransmitting the binary information further comprises transmitting: afirst particular bit pair representing a payload type for use by areceiving device; a second particular bit pair representing a frameidentification for use by a receiving device; a third particular set ofone or more bit pairs representing inversion indicator information foruse by the receiving device to recover at least a portion of the firstbinary data.
 21. The apparatus of claim 17 wherein the transmitter isfurther configured to: transmit pairs of binary bits wherein at leastone of the pairs of binary bits represents a particular ternary valueand a different one of the pairs of binary bits represents an illegalvalue; transmit at least one pair of binary bits representing theillegal value to effect synchronization of communication between themovable barrier operator and the peripheral device.
 22. The apparatus ofclaim 21 wherein the transmitter is further configured to transmit: afirst particular bit pair representing a payload type for use by areceiving device; a second particular bit pair representing a frameidentification for use by a receiving device; a third particular set ofone or more bit pairs representing inversion indicator information foruse by the receiving device to recover at least a portion of the firstbinary data.
 23. The apparatus of claim 13 wherein the transmitter isfurther configured to transmit: a first particular bit pair representinga payload type for use by a receiving device; a second particular bitpair representing a frame identification for use by a receiving device;a third particular set of one or more bit pairs representing inversionindicator information for use by the receiving device to recover atleast a portion of the first binary data.
 24. The apparatus of claim 13wherein the transmitter is further configured to transmit the illegalvalue as a value not expected to occur when transmitting binary bitsrepresenting particular ternary values.
 25. The apparatus of claim 13wherein the transmitter is further configured to transmit the illegalvalue as corresponds to a value other than a ternary value of 0, 1, or2.
 26. The method of claim 1 wherein the transmitting the different oneof the pairs of binary bits that represents the illegal value furthercomprises transmitting the illegal value as a value not expected tooccur when transmitting binary bits representing particular ternaryvalues.
 27. The method of claim 1 wherein the transmitting the differentone of the pairs of binary bits that represents the illegal valuefurther comprises transmitting the illegal value as corresponds to avalue other than a ternary value of 0, 1, or 2.